Finding independent transversals efficiently
نویسندگان
چکیده
منابع مشابه
Odd Independent Transversals are Odd
We put the final piece into a puzzle first introduced by Bollobás, Erdős and Szemerédi in 1975. For arbitrary positive integers n and r we determine the largest integer ∆ = ∆(r, n), for which any r-partite graph with partite sets of size n and of maximum degree less than ∆ has an independent transversal. This value was known for all even r. Here we determine the value for odd r and find that ∆(...
متن کاملAlgorithms for finding clique-transversals of graphs
A clique-transversal of a graph G is a subset of vertices intersecting all the cliques of G. It is NP-hard to determine the minimum cardinality τc of a clique-transversal of G. In this work, first we propose an algorithm for determining this parameter for a general graph, which runs in polynomial time, for fixed τc. This algorithm is employed for finding the minimum cardinality clique-transvers...
متن کاملEfficiently finding bitangents
We propose a new algorithm for the detection of bitangents in planar curves. It is much faster than an algorithm used by Rothwell et al. (95). Careful comparisons of the stability of detection using artificially transformed curves show that the new algorithm is as stable as the one proposed by Rothwell et al. An example for the use of the algorithm for object search is given.
متن کاملFinding Optimal Flows Efficiently
Among the models of quantum computation, the One-way Quantum Computer [10, 11] is one of the most promising proposals of physical realization [12], and opens new perspectives for parallelization by taking advantage of quantum entanglement [2]. Since a one-way quantum computation is based on quantum measurement, which is a fundamentally nondeterministic evolution, a sufficient condition of globa...
متن کاملFinding Skew Partitions Efficiently
A skew partition as defined by Chvátal is a partition of the vertex set of a graph into four nonempty parts A B C D such that there are all possible edges between A and B and no edges between C and D. We present a polynomial-time algorithm for testing whether a graph admits a skew partition. Our algorithm solves the more general list skew partition problem, where the input contains, for each ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2020
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548320000127